#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5;
ll read(){
    ll x=0,f=1;char c=getchar();
    for(;!isdigit(c);c = getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c = getchar()) x=(x<<1)+(x<<3)+(c^48);
    return x*f;
}
ll cmp(ll x, ll y)
{
    return x < y;
}
ll n,ans;
ll R[N + 5];
queue<ll> q;

int main(){
   freopen("duel.in","r",stdin);
   freopen("duel.out","w",stdout);
    n = read();
    ans = n;
    for(ll i = 1 ; i<= n; i++)
     {
         R[i] = read();
     }
    sort(R + 1, R + 1 + n , cmp);
    q.push(R[1]);
    for(ll i = 2;i <= n;i++)
    {
        ll x = q.front();
        if(x < R[i]) q.pop(),ans--;
        q.push(R[i]);
    }
    cout<<ans;
    return 0;
}
